Robust polyhedral Minkowski sums with GPU implementation
نویسندگان
چکیده
We present a Minkowski sum algorithm for polyhedra based on convolution. We develop robust CPU and GPU implementations, using our ACP robustness technique to enforce a user-specified backward error bound. We test the programs on 45 inputs with an error bound of 10−8. The CPU program outperforms prior work, including non-robust programs. The GPU program exhibits a median speedup factor of 36, which increases to 68 on the 6 hardest tests. For example, it computes a Minkowski sum with a million features in 20 seconds.
منابع مشابه
Voxelized Minkowski sum computation on the GPU with robust culling
We present a new approach for computing the voxelized Minkowski sum (excluding any enclosed voids) of two polyhedral objects using programmable Graphics Processing Units (GPUs). We first cull out surface primitives that will not contribute to the final boundary of the Minkowski sum, analyzing and adaptively bounding the rounding errors of the culling algorithm to solve the floating point error ...
متن کاملMinkowski sum of HV-polytopes in Rn
Minkowski sums cover a wide range of applications in many different fields like algebra, morphing, robotics, mechanical CAD/CAM systems ... This paper deals with sums of polytopes in a n dimensional space provided that both H-representation and V-representation are available i.e. the polytopes are described by both their half-spaces and vertices. The first method uses the polytope normal fans a...
متن کاملRobust approximate assembly partitioning
We present a robust approximate assembly partitioning algorithm for polyhedral parts. We achieve robustness by applying our controlled linear perturbation strategy to Minkowski sums of polyhedra and to arrangements of great circle arcs. Our algorithm is far faster than a prior robust algorithm based on exact computational geometry. Its error is small even on degenerate input.
متن کاملExact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces
We present the first exact and robust implementation of the 3D Minkowski sum of two non-convex polyhedra. Our implementation decomposes the two polyhedra into convex pieces, performs pairwise Minkowski sums on the convex pieces, and constructs their union. We achieve exactness and the handling of all degeneracies by building upon 3D Nef polyhedra as provided by Cgal. The implementation also sup...
متن کاملExact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
TheMinkowski sum of two setsA,B ∈ IR, denotedA⊕B, is defined as {a+ b | a ∈ A, b ∈ B}. We describe an efficient and robust implementation for the construction of Minkowski sums of polygons in IR using the convolution of the polygon boundaries. This method allows for faster computation of the sum of non-convex polygons in comparison to the widely-used methods for Minkowski-sum computation that d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer-Aided Design
دوره 67-68 شماره
صفحات -
تاریخ انتشار 2015